منابع مشابه
Closed Factorization
A closed string is a string with a proper substring that occurs in the string as a prefix and a suffix, but not elsewhere. Closed strings were introduced by Fici (Proc. WORDS, 2011) as objects of combinatorial interest in the study of Trapezoidal and Sturmian words. In this paper we present algorithms for computing closed factors (substrings) in strings. First, we consider the problem of greedi...
متن کاملInert Module Extensions, Multiplicatively Closed Subsets Conserving Cyclic Submodules and Factorization in Modules
Introduction Suppose that is a commutative ring with identity, is a unitary -module and is a multiplicatively closed subset of . Factorization theory in commutative rings, which has a long history, still gets the attention of many researchers. Although at first, the focus of this theory was factorization properties of elements in integral domains, in the late nineties the theory was gener...
متن کاملRobust Control and Closed-loop Identification by Normalized Coprime Factorization
This paper deals with design of a failure tolerant control system where failures are identified using the normalized coprime factorization method. The identification method employed is a closed-loop one, which is also based on coprime factorization; therefore, the method is suitable to the robust control systems. The impact of failure on the closed-loop stability is evaluated by ν-gap metric ob...
متن کاملClosed-form marginal likelihood in Gamma-Poisson factorization
We present novel understandings of the Gamma-Poisson (GaP) model, a probabilistic matrix factorization model for count data. We show that GaP can be rewritten free of the score/activation matrix. This gives us new insights about the estimation of the topic/dictionary matrix by maximum marginal likelihood estimation. In particular, this explains the robustness of this estimator to over-specified...
متن کامل$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.04.009